Partition Into Triangles on Bounded Degree Graphs
نویسندگان
چکیده
منابع مشابه
Packing triangles in bounded degree graphs
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable if the maximum degree of the input graph is at most 3 (respectively 4), whereas it is APX-hard for general graphs and NP-hard for planar graphs if the maximum degree is 4 (respectiv...
متن کاملSparse Partition Universal Graphs for Graphs of Bounded Degree
In 1983, Chvátal, Trotter and the two senior authors proved that for any ∆ there exists B so that, for any n, any 2-coloring of the edges of the complete graph KN with N ≥ Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree ∆. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2−1/∆ log N) edges, with N = bB...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملComplexity and Kernels for Bipartition into Degree-bounded Induced Graphs
In this paper, we study the parameterized complexity of the problems of partitioning the vertex set of a graph into two parts VA and VB such that VA induces a graph with degree at most a (resp., an a-regular graph) and VB induces a graph with degree at most b (resp., a b-regular graph). These two problems are called Upper-Degree-Bounded Bipartition and Regular Bipartition respectively. First, w...
متن کاملOn Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9412-5